A Matheuristic Approach to the Integration of Three-Dimensional Bin Packing Problem and Vehicle Routing Problem with Simultaneous Delivery and Pickup

This work presents a hybrid approach to solve distribution problem of Portuguese company in the automotive industry. The objective is determine minimum cost for daily operations, such as collecting and delivering goods multiple suppliers. Additional constraints are explicitly considered, time windows loading due limited capacity fleet terms weight volume. An exhaustive review state art was conducted, presenting different typology schemes from literature pickup delivery problems field. Two mathematical models were integrated within matheuristic approach. One model reflects combination Vehicle Routing Problem with Simultaneous Delivery Pickup Capacitated Time Windows. second one aims pack all items be delivered onto pallets, reflecting three-dimensional single bin size Bin Packing Problem. Both formulations proposed—a commodity-flow formulation Three-Dimensional must solved matheuristic. All approaches tested using real instances data provided by company. computational experiments benchmark also performed.